#include <iostream>
#include "vector"
#include "map"
#include <unordered_map>
#include <stack>
#include <math.h>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <unordered_set>
#include <queue>
#include <cctype>
using namespace std;
struct ListNode
{
    int val;
    ListNode *next;
    ListNode(int x) : val(x), next(NULL) {}
};
struct TreeNode
{
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode() : val(0), left(nullptr), right(nullptr) {}
    TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
    TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
};
class Node
{
public:
    int val;
    Node *left;
    Node *right;
    Node *next;

    Node() : val(0), left(NULL), right(NULL), next(NULL) {}

    Node(int _val) : val(_val), left(NULL), right(NULL), next(NULL) {}

    Node(int _val, Node *_left, Node *_right, Node *_next)
        : val(_val), left(_left), right(_right), next(_next) {}
};

class Solution
{
public:
    int uniquePaths(int m, int n)
    {
        // dp[i][j]
    }
};

int main()
{
    Solution s;
    vector<int> bills = {5, 5, 10, 10, 20};
    cout << s.lemonadeChange(bills);
    return 0;
}